An improved multilevel successive elimination algorithm for fast full-search motion estimation
نویسندگان
چکیده
It is well known that a lot of computations are required for motion estimation in video encoding. Recently, the multilevel successive elimination algorithm (MSEA) has been proposed to reduce the computational complexity of block matching for motion estimation without degradation of estimation accuracy. In the MSEA, the block matching is hierarchically carried out and the invalid candidate block is successively eliminated. In this paper, we propose an improved MSEA based on a new efficient decision condition. The number of the calculations to eliminate the invalid block can be reduced by the new efficient decision condition in the proposed algorithm. The simulation results show that the proposed algorithm achieves about 30~40% computational saving as compared with the MSEA.
منابع مشابه
An Optimal Fast Full Search Motion Estimation and Suboptimal Motion Estimation Algorithms
The new fast full search motion estimation algorithm for optimal motion estimation is proposed in this paper. The Fast Computing Method (FCM) which calculates the tighter boundaries faster by exploiting the computational redundancy and the Best Initial Matching Error Predictive Method (BIMEPM) which predicts the best initial matching error that enables the early rejection of highly impossible c...
متن کاملEfficient tree structured motion estimation using successive elimination - Vision, Image and Signal Processing, IEE Proceedings-
In H.264/AVC, tree structured motion estimation enhances the coding efficiency significantly while dramatically increasing the computational complexity of block matching. In the paper, a successive elimination algorithm (SEA) is implemented in tree structured motion estimation with a simple and effective method to determine the initial motion vector, which exploits the strong correlation among ...
متن کاملAn Efficient Motion Multiple Reference F
The H.264/AVC coding standard allows more than one decoded frame reference frames to make full use of reducing temporal redundancy in a video sequence. However, motion estimation in multiple frames introduces tremendous computational complexity. This paper presents a fast full search motion estimation algorithm for multiple reference frame motion estimation. The proposed method can be applied t...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملExtended Successive Elimination Algorithm for Fast Optimal Block Matching Motion Estimation
In this paper, we propose an extended successive elimination algorithm (SEA) for fast optimal block matching motion estimation (ME). By reinterpreting the typical sum of absolute differences measure, we can obtain additional decision criteria whether to discard the impossible candidate motion vectors. Experimental results show that the proposed algorithm reduces the computational complexity up ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003